Optimized Fast Walsh-Hadamard Transform on GPUs for non-binary LDPC decoding
نویسندگان
چکیده
The Fourier Transform Sum-Product Algorithm (FT-SPA) used in non-binary Low-Density Parity-Check (LDPC) decoding makes extensive use of the Walsh-Hadamard Transform (WHT). We have developed a massively parallel Fast Walsh-Hadamard Transform (FWHT) which exploits the Graphics Processing Unit (GPU) pipeline and memory hierarchy, thereby minimizing the level of memory bank conflicts and maximizing the number of returned instructions per clock cycle for different generations of graphics processors, with considerable speedup gains in FT-SPA based non-binary LDPC decoding.
منابع مشابه
Chained Successive Cancellation Decoding of the Extended Golay code
The extended Golay code is shown to be representable as a chained polar subcode. This enables its decoding with the successive cancellation decoding algorithm and its stack generalization. The decoder can be further simplified by employing fast Hadamard transform. The complexity of the obtained algorithm is comparable with that of the Vardy algorithm.
متن کاملOptimal soft decision block decoders based on fast Hadamard transform
AMrcrctAn approach for efficient utilization of fast Hadamard transform in decoding binary linear block codes is presented. Computational gain is obtained by employing various types of concurring codewords, and memory reduction is also achieved by appropriately selecting rows for the generator matix. The availability of these codewords in general, and particularly in some of the most frequently...
متن کاملFast Decoding of the p-Ary First-Order Reed-Muller Codes Based On Jacket Transform
order Reed-Muller code guaranteeing correction of up to •un/4 sin(p-1/2 pƒÎ)•v errors and having complexity proportional to nlogn, where n=pm is the code length and p is an odd prime. This algorithm is an extension in the complex domain of the fast Hadamard transform decoding algorithm applicable to the binary case. key words: p-ary first-order Reed-Muller codes, decoding algorithms, Jacket matrix
متن کاملFourier Transform Decoding of Non-Binary LDPC Codes
Binary low-density parity-check (LDPC) codes have recently emerged as a promising alternative to turbo codes and have been shown to achieve excellent coding gains in AWGN channels. Non-binary LDPC codes have demonstrated improved performance over binary LDPC codes but their decoding is computationally intensive. Fourier transform decoding can reduce the decoding complexity but has a number of p...
متن کاملIterative Decoding withM -ary Orthogonal Walsh Modulation in OFDM-CDMA Systems
Iterative decoding of a serial concatenated coding scheme consisting of an outer convolutional code and M -ary orthogonal Walsh modulation as inner Walsh-Hadamard block code in an OFDM-CDMA system is applied. New aspects arise because OFDM enables the iterative decoding structure to exploit time as well as frequency diversity of a mobile channel. Moreover, the paper points out the low complex s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Parallel Computing
دوره 40 شماره
صفحات -
تاریخ انتشار 2014